Inference by belief propagation in composite systems.

نویسندگان

  • Etienne Mallard
  • David Saad
چکیده

We devise a message passing algorithm for probabilistic inference in composite systems, consisting of a large number of variables, that exhibit weak random interactions among all variables and strong interactions with a small subset of randomly chosen variables; the relative strength of the two interactions is controlled by a free parameter. We examine the performance of the algorithm numerically on a number of systems of this type for varying mixing parameter values.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Systems Diagnosis Using Belief Propagation

In this paper, we focus on diagnosis in distributed computer systems using end-to-end transactions, or probes. Diagnostic problem is formulated as a probabilistic inference in a bipartite noisy-OR Bayesian network. Due to general intractability of exact inference in such networks, we apply belief propagation (BP), a popular approximation technique proven successful in various applications, from...

متن کامل

Particle-based Variational Inference for Continuous Systems

Since the development of loopy belief propagation, there has been considerable work on advancing the state of the art for approximate inference over distributions defined on discrete random variables. Improvements include guarantees of convergence, approximations that are provably more accurate, and bounds on the results of exact inference. However, extending these methods to continuous-valued ...

متن کامل

Expectation Propogation for Approximate Inference in Dynamic Bayesian Networks

We describe expectation propagation for ap­ proximate inference in dynamic Bayesian net­ works as a natural extension of Pearl's ex­ act belief propagation. Expectation propa­ gation is a greedy algorithm, converges in many practical cases, but not always. We de­ rive a double-loop algorithm, guaranteed to converge to a local minimum of a Bethe free energy. Furthermore, we show that stable fixe...

متن کامل

Learning unbelievable probabilities

Loopy belief propagation performs approximate inference on graphical models with loops. One might hope to compensate for the approximation by adjusting model parameters. Learning algorithms for this purpose have been explored previously, and the claim has been made that every set of locally consistent marginals can arise from belief propagation run on a graphical model. On the contrary, here we...

متن کامل

Causal Inference in Biology Networks with Integrated Belief Propagation

Inferring causal relationships among molecular and higher order phenotypes is a critical step in elucidating the complexity of living systems. Here we propose a novel method for inferring causality that is no longer constrained by the conditional dependency arguments that limit the ability of statistical causal inference methods to resolve causal relationships within sets of graphical models th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 78 2 Pt 1  شماره 

صفحات  -

تاریخ انتشار 2008